Distance Semantics for Relevance-Sensitive Belief Revision

نویسندگان

  • Pavlos Peppas
  • Samir Chopra
  • Norman Y. Foo
چکیده

Possible-world semantics are provided for Parikh’s relevance-sensitive model for belief revision. Having Grove’s system-of-spheres construction as a base, we consider additional constraints on measuring distance between possible worlds, and we prove that, in the presence of the AGM postulates, these constraints characterize precisely Parikh’s axiom (P). These additional constraints essentially generalize a criterion of similarity that predates axiom (P) and was originally introduced in the context of Reasoning about Action. A by-product of our study is the identification of two possible readings of Parikh’s axiom (P), which we call the strong and the weak versions of the axiom. An interesting feature of the strong version is that, unlike classical AGM belief revision, it makes associations between the revision policies of different theories.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Distance Semantics for Relevance-Sensitive Belief Revision Extended Abstract

The AGM postulates [4], [1] are widely regarded to have captured much of what is involved in the process of rational belief revision. Recently however, Parikh [7] observed that despite their success, the AGM postulates are rather liberal in their treatment of the notion of relevance. More precisely, Parikh argues that during belief revision a rational agent does not change her entire belief cor...

متن کامل

Belief Revision of Logic Programs under Answer Set Semantics

We address the problem of belief revision in (nonmonotonic) logic programming under answer set semantics: given logic programs P and Q, the goal is to determine a program R that corresponds to the revision of P by Q, denoted P ∗ Q. Unlike previous approaches in logic programming, our formal techniques are analogous to those of distance-based belief revision in propositional logic. In developing...

متن کامل

Relevance Sensitive Non-Monotonic Inference on Belief Sequences

We present a method for relevance sensitive nonmonotonic inference from belief sequences which incorporates insights pertaining to prioritized inference and relevance sensitive, inconsistency tolerant belief revision. Our model uses a finite, logically open sequence of propositional formulas as a representation for beliefs and defines a notion of inference from maxiconsistent subsets of formula...

متن کامل

A A Model-theoretic Approach to Belief Change in Answer Set Programming

We address the problem of belief change in (nonmonotonic) logic programming under answer set semantics. Our formal techniques are analogous to those of distance-based belief revision in propositional logic. In particular, we build upon the model theory of logic programs furnished by SE interpretations, where an SE interpretation is a model of a logic program in the same way that a classical int...

متن کامل

Dynamic Interpretations and Interpretation Structures

Dynamic semantics has its roots in the research of anaphoric reference. It is well known that in general anaphoric relations are highly context sensitive and defeasible. However, most standard frameworks of dynamic semantics, such as Discourse Representation Theory (DRT) and Dynamic Predicate Logic, do not deal with problems of interpretation revision 1 (cf. [6]). Furthermore, these frameworks ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2004